منابع مشابه
Disjoint Minimal Graphs
We prove that the number s(n) of disjoint minimal graphs supported on domains in Rn is bounded by e(n+1)2 . In the two-dimensional case we show that s(2) ≤ 3.
متن کاملFiniteness of Disjoint Minimal Graphs
of u in R is called a minimal graph supported on Ω. In a recent article of Meeks-Rosenberg [M-R], where they proved the unicity of the helicoid, the authors showed that if the defining functions {ui} of a set of disjointly supported minimal graphs {Gi} have bounded gradients, then the number of graphs must be finite. In a private communication with the first author, Rosenberg posed the question...
متن کاملEfficient algorithms for minimal disjoint path problems on chordal graphs
Disjoint paths have applications in establishing bottleneck-free communication between processors in a network. The problem of finding minimum delay disjoint paths in a network directly reduces to the problem of finding the minimal disjoint paths in the graph which models the network. Previous results for this problem on chordal graphs were an O(| V | | E |) algorithm for 2 edge disjoint paths ...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملminimal, vertex minimal and commonality minimal cn-dominating graphs
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Global Analysis and Geometry
سال: 2008
ISSN: 0232-704X,1572-9060
DOI: 10.1007/s10455-008-9127-7